Method and system of data modelling

ABSTRACT

A system for large scale data modelling is described. The system includes at least one data measurement sensor ( 230 ) for generating measured data, a training processor ( 240 ) to determine optimized hyperparameter values in relation to a Gaussian process covariance function including a sparse covariance function that is smooth and diminishes to zero outside of a characteristic hyperparameter length. An evaluation processor ( 260 ) determines model data from the Gaussian process covariance function with optimised hyperparameter values and measured data. Also described is methods for modelling date, including a method using a Gaussian process including a sparse covariance function that diminishes to zero outside of a characteristic length, wherein the characteristic length is determined from the data to be modelled.

FIELD OF THE INVENTION

This invention relates to the field of large scale data modelling. Examples of its application include, but are not limited to spatial data modelling such as, in-ground ore grade estimation for mining and terrain modelling for robotic vehicle navigation.

BACKGROUND OF THE INVENTION

Gaussian Process regression models are used to determine functions that model known data. The known data can be, for example, discrete elevation measurements over a certain area. The model would then provide a means of inferring values for intermediate points that were not measured, called test points.

In a large scale environment like an open-cut mine spatial modelling of geography and geology can have many uses in planning, analysis and operations within the environment. In the case of automated mining, a geographical model or terrain map can be used to guide robotic vehicles, whilst an in-ground geological model of the ore body may be used to determine drilling and blasting operations.

A digital representation of the operating environment in the form of a spatial model is typically generated from sensor measurements which provide a sample of the actual environmental variable being modelled (e.g. elevation in the case of a terrain map, or ore grade in the case of in-ground ore body modelling) at various spatially distinct locations within the operating environment. The measured sample data is then treated in some manner such as by interpolation to determine information about the environment in locations other than those actually measured. Some of the challenges posed by this task include dealing with the issues of uncertainty, incompleteness and handling potentially large measurement data sets.

Gaussian Processes (GPs) are stochastic processes based on the normal (Gaussian) distribution and can be used to good effect as a powerful nonparametric learning technique for modelling. Inference of continuous values with a Gaussian process prior is known as Gaussian process regression, and is sometimes referred to as “Kriging”.

Whilst Gaussian processes are a useful and powerful tool for regression in supervised machine learning they are regarded as a computationally expensive technique, which is particularly disadvantageous in the treatment of large measurement data sets. The computational expense is primarily brought on by the need to invert a large covariance matrix during the inference procedure. For problems with thousands of observations, exact inference in normal Gaussian processes is intractable and approximation algorithms are required.

SUMMARY OF THE INVENTION

In one embodiment the invention provides a method for modelling data using a Gaussian process including a sparse covariance function that diminishes to zero outside of a characteristic length, wherein the characteristic length is determined from the data to be modelled.

In one embodiment the sparse covariance function is smooth. In another embodiment the sparse covariance function has a continuous fourth derivative. In another embodiment the characteristic length is determined through a machine learning process. In another embodiment the sparse covariance function is multi-dimensional with a separate characteristic length for each dimension. In another embodiment the Gaussian process further includes a non-stationary covariance function. In another embodiment the non-stationary covariance function is a neural network covariance function. In another embodiment the sparse covariance function and non-stationary covariance function are combined in Gaussian process regression computations. In another embodiment the data is measured using one or more measurement sensors. In another embodiment the data represents geographical surface terrain. In another embodiment the data represents in-ground geological mineral distribution.

In one embodiment the invention provides a method for modelling large scale data representing a distribution of physical properties, including obtaining a measured dataset, applying an exactly sparse Gaussian process covariance function to the measured dataset to determine an optimized set of hyperparameter values associated with the Gaussian process covariance function, and generating selected model data by Gaussian process regression using the optimized hyperparameter set and the measured dataset.

In one embodiment the exactly sparse Gaussian process covariance function includes a sparse covariance function that is smooth and diminishes to zero outside of a characteristic hyperparameter length, and a non-stationary neural network covariance function.

In another embodiment the sparse covariance function is multi-dimensional with a separate characteristic hyperparameter length for each dimension. In another embodiment the measured dataset represents geographical surface terrain measurements. In another embodiment the measured dataset represents in-ground geological mineral distribution measurements.

In one embodiment the invention provides a system for large scale data modelling, including at least one data measurement sensor for generating measured data representing a distribution of physical properties in a selected geographical region; a training processor adapted to determine for the measured data optimized hyperparameter values in relation to a Gaussian process covariance function including a sparse covariance function that is smooth and diminishes to zero outside of a characteristic hyperparameter length; and an evaluation processor adapted to determine model data from the Gaussian process covariance function with optimised hyperparameter values and measured data.

In one embodiment the Gaussian process covariance function also includes a non-stationary neural network covariance function. In another embodiment the measured data comprises geographical surface terrain measurements. In another embodiment the measured data comprises in-ground ore grade distribution measurements.

In another embodiment the invention provides a computational method for modelling a data space, the method including using a computational system, applying to the data space a kernel machine, wherein the kernel machine uses a covariance function which is constructed from a smooth basis function equal to zero outside of a defined interval; one of outputting and storing in memory a model from the kernel machine.

In another embodiment the kernel machine uses a Gaussian learning process. In another embodiment the basis function is a squared cosine wave. In another embodiment the basis function is cos² (πx)H(0.5−|x|) where H(.) is a step function.

In another embodiment the multi-dimensional data space has N dimensions and the covariance function is

${K_{1}\left( {x,{x^{\prime};l},\sigma_{0}} \right)} = \left\{ {{{\begin{matrix} {\sigma_{0}\begin{bmatrix} {{\frac{2 + {\cos\left( {2\pi\;\frac{d}{l}} \right)}}{3}\left( {1 - \frac{d}{l}} \right)} +} \\ {\frac{1}{2\pi}{\sin\left( {2\pi\;\frac{d}{l}} \right)}} \end{bmatrix}} & {{{if}\mspace{14mu} d} < l} \\ 0 & {{{{if}\mspace{14mu} d} \geq l},} \end{matrix}d} = {{x - x^{\prime}}}},} \right.$ extended to multiple dimensions.

In another embodiment the defined interval is a hyperparameter.

In another embodiment the invention provides a method for modelling a data space, the method including using a computational system, applying to the data space a kernel machine, wherein the kernel of the kernel machine is a positive semi-definite function and a symmetric function, equal to zero outside of a defined interval, and at least one of one of outputting and storing in memory a model from the Gaussian regression process.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be more fully understood through the following description of an embodiment thereof together with the illustrations in the accompanying drawings in which:

FIG. 1 is an example computing system utilisable to implement a terrain modelling system in accordance with an embodiment of the invention;

FIG. 2 is a diagrammatic illustration of a terrain region and a system adapted for generating and maintaining a corresponding digital terrain model for use in controlling autonomous vehicles;

FIG. 3 is a diagrammatic illustration of sensor sample data points representing elevation information across the terrain region of FIG. 2;

FIG. 4 is a flow-chart diagram showing a training phase for a terrain data modelling process;

FIG. 5 is a diagrammatic representation of the evaluation phase for the terrain data modelling process;

FIG. 6 is a plot of the covariance function for an exactly sparse Gaussian process for various values of hyperparameter l; and

FIGS. 7 and 8 show a comparison between the outputs of a Gaussian process model utilising a neural network covariance function K_(NN) and the new covariance function K_(M) that results in an exactly sparse Gaussian process.

FIG. 9 shows a normalized squared error for different covariance functions and the standard deviation as a function of the number of inference points.

FIG. 10 shows the percentage of zeros in the covariance matrix as a function of the number of inference points.

DETAILED DESCRIPTION OF THE EMBODIMENTS

It will be understood that the invention disclosed and defined in this specification extends to all alternative combinations of two or more of the individual features mentioned or evident from the text or drawings. All of these different combinations constitute various alternative aspects of the invention.

The present invention may be applied to digital terrain modelling as described hereinbelow in a non-limiting example of its implementation.

1. System Overview

Referring to FIG. 1, an embodiment of a terrain modelling system is implemented with the aid of appropriate computer hardware and software in the form of a computing system 100. The computing system 100 comprises suitable components necessary to receive, store and execute appropriate computer instructions. The components may include a processing unit 102, read only memory (ROM) 104, random access memory (RAM) 106, an input/output device such as disk drives 108, communication links 110 such an Ethernet port, a USB port, etc. and a display 113 such as a video display or any other suitable display. The computing system 100 includes instructions that may be included in ROM 104, RAM 106 or disk drives 108 and may be executed by the processing unit 102. There may be provided a plurality of communication links 110 which may variously connect to one or more computing devices such as a server, personal computers, terminals, wireless handheld computing devices or other devices capable of receiving and/or sending electronic information. At least one of a plurality of communications links may be connected to an external computing network through a telephone line, an Ethernet connection, or any type of communications link. Additional information may be entered into the computing system by way of other suitable input devices such as, but not limited to, a keyboard and/or mouse (not shown).

The computing system may include storage devices such as a disk drive 108 which may encompass solid state drives, hard disk drives, optical drives or magnetic tape drives. The computing system 100 may use a single disk drive or multiple disk drives. A suitable operating system 112 resides on the disk drive or in the ROM of the computing system 100 and cooperates with the hardware to provide an environment in which software applications can be executed.

In particular, the data storage system is arranged to store measurement data received from the sensors, in a suitable database structure 114. The data storage system also includes a terrain model 116, which is utilised with the measurement data to provide a 2.5D “map” of the terrain. The data storage system may be integral with the computing system, or it may be a physically separate system.

In more detail, the data storage system is loaded with a modelling module including various sub-modules (not shown). The sub-modules are arranged to interact with the hardware of the computing system 100, via the operating system 116, to either receive the data collected by the measurement sensors (generally sent via the communications links 114) and/or process the received data to provide the measured data. In some embodiments, there may be provided a visual display unit, which may be in either local or remote communication with the computing system 100, and is arranged to display information relating to the programs being run thereon. In other embodiments, the data may be used directly by an autonomous robot (e.g. an automated vehicle) to perform particular tasks, such as navigation of the terrain.

FIG. 2 is a diagrammatic illustration of a terrain region and a system adapted for generating and maintaining a corresponding digital terrain model for use in controlling autonomous vehicles. The terrain modelling system 210 operates on a terrain region 220 in the form of an open pit mine, and utilises one or more measurement sensors 230 to provide measured terrain data about the region 220. The sensor 230 provides spatial data measured from the terrain region 220 which can be generated by a number of different methods, including laser scanning, radar scanning, GPS or manual survey. One example of an appropriate measurement sensor is the LMS Z420 time-of-flight laser scanner available from Riegl. This form of sensor can be used to scan the environment region and generate a 3D point cloud comprising (x, y, z) data in three frames of reference. In the system 210 illustrated, two separate scanners are shown disposed to opposite sides of the terrain to be modelled so as to minimise occlusions and the like.

The sampled spatial data compiled from the sensors is illustrated diagrammatically in FIG. 3, which shows a distribution 300 of individual sample data points 310 collected from across the terrain region representing the surface elevation at various locations. In order to build a terrain model the collection of sample data points are used as described below in a computational system involving Gaussian processes to enable the surface elevation to be inferred at any location in the terrain region.

The measurement sensor data generated by the sensors 230 is provided to a training processor 240 coupled to data storage 250. The training processor 240 is adapted to organise the sensor data and determine a non-parametric, probabilistic, multi-scale representation of the data for use in terrain modelling, which is stored in the data storage 250. Details of the specific operational procedures carried out by the training processor are described below with reference to FIG. 4.

An evaluation processor 260 is also coupled to access the data storage 250 and is adapted to utilise the data from the data storage 250 and terrain model data according to a desired modelling grid resolution. Specific operational details of the evaluation processor are provided below with reference to FIG. 5. Once the terrain model data has been generated it can be communicated to an autonomous robotic vehicle 280, operating within the modelled environment, by a suitable communications medium 270, such as a radio communication link.

FIG. 4 is a flow-chart diagram showing a training phase procedure 400 for the terrain data modelling process. The procedure 400 that begins with obtaining sensor measurement data at step 410 from an appropriate source, in this case a Riegl LMS Z420 3D laser scanner. The laser scanner mentioned generates in the order of two-million data points for a given scan. Previously known Gaussian processes would typically require such a dataset to be reduced in magnitude in order to reduce the computational complexity and data storage requirements. In other words, a prior art Gaussian process may discard most of the measured data to reduce the number of data points to be used for actually generating the terrain model. By way of example, known Gaussian processes may necessitate the sensor measurement dataset being reduced from millions of data points down to thousands of data points. However, a Gaussian process employing a modified covariance function is described below which allows all of the measured data to be incorporated into the model without arbitrary sampling reduction. This process is thus well-suited for modelling large scale data, and particularly advantageous where the number of data points exceeds approximately 5000.

For ease of storage and retrieval the data storage 250 can make use of an efficient, hierarchical data structure known as a KD-Tree. The use of such a data structure provides the training and evaluation processors with rapid access to the sampled measurement data on demand. After the data has been input to the training processor 420 it is converted to KD-Tree data 430 and stored 440.

The data storage step is followed by a Gaussian process learning procedure at step 450, with the objective of learning a representation of the spatial data. Details of the Gaussian process learning procedure are provided below. This method provides for a non-parametric, probabilistic, multi-scale representation of the data. No explicit assumption of the underlying functional model is made.

Hyperparameters are determined from the data to be modelled. The hyperparameters can be learnt from the measured data using a manual process, i.e. using a trial and error process. The hyperparameters can also be learnt using a machine learning process. Typical methods include using leave-one-out cross-validation (LOOCV), also called rotation estimation, and Bayesian learning such as Maximum Likelihood Estimation.

In this example, a Maximum Likelihood Estimation method is used.

There are also various methods that can be used to optimise the hyperparameters. These include Broyden-Fletcher-Goldfarb-Shanno (BFGS) gradient descent and simulated annealing. In the example described in this specification, a combination of these two methods is used.

The covariance function hyperparameters provide a coarse description of the terrain model, and can be used together with the sensor measurement data to generate detailed terrain model data at any desired resolution, including a statistically sound uncertainty estimate. The optimized covariance function hyperparameters are stored 470, together with the KD-Tree sample data structure, for use by the evaluation procedure.

The hyperparameters determined for this example application are: σ₀, a scaling factor, σ_(n), a noise component, and l, the characteristic length, which describes the distance over which points are correlated in a certain neighbourhood.

It is also possible to obtain an estimate of the hyperparameters without using machine learning. It can be done through an iterative manual estimation process, for example.

FIG. 5 is a diagrammatic representation of the evaluation phase procedure 500 for the terrain data modelling process. The sensor measurement spatial data stored in the KD-Tree and the Gaussian process model hyperparameters obtained in the learning phase are used here as the input data to the GP evaluation process 520. Since the Gaussian process representation obtained is a continuous domain one, applying the model for any desired resolution amounts to sampling the model at that resolution, as the data required for the grid resolution (in 510) can be obtained as outlined below.

A grid in the area of interest, at the desired resolution is formed. The objective is to use the learnt spatial model to estimate the elevation at individual points in this grid. Each point in the grid is interpolated with respect to the model learnt in the previous step and the nearest training data around that point. For this step, the KD-Tree naturally and efficiently provides access to the nearest known data. This together with the learnt model provides an interpolation estimate for the desired location in the grid. The estimate is also accompanied with an uncertainty measure that is simultaneously computed in a statistically sound manner. Details of the Gaussian process evaluation and computational procedures are provided below. It is a benefit of the covariance function used with the Gaussian Process as described below that the data neighbourhood can be determined from the data relatively quickly. It is also possible to know with an increased certainty that the impact of the data points outside the neighbourhood is zero. This neighbourhood of relevant points is shown in the KD-Tree structure.

The output 530 of the Gaussian process evaluation 520 is a digital elevation map/grid at the chosen resolution and region of interest together with an appropriate measure of uncertainty for every point in the map. The digital elevation map may be used as is or may be rapidly processed into a digital surface/terrain model and used thereafter for robotic vehicle navigation and the like in known fashion.

Although the foregoing description relates to spatial data modelling, in particular to terrain modelling of a mine, it will be readily appreciated that the data modelling methodologies described herein are not limited to this application. Any modelling problem to which a Gaussian Process is applied may use the modified covariance function described herein, with fields including, and not limited to, weather forecasting, financial forecasting, bio-medical diagnosis, geometric modelling, stochastic maintenance modelling, astronomy, internet and search analysis, speech recognition, face recognition, audio/video data study, geophysics, mining, hydrology, reservoir engineering and robotics. As an example, the invention is also applicable to in-ground ore grade estimation, also in a mining context, where modelling of in-ground ore distributions are desired on the basis of drill hole analyses or other measurements. In the case of in-ground mineral distribution the data can have more dimensions than when considering surface elevation data.

In other applications, the input data to the process 510 can include multi-dimensional data points 410 of any dimensions and can represent a wide variety of parameters, including and not limited to time, distance, grade of material, temperature, humidity and density. These data points can be obtained in various ways, and need not be obtained by a sensor as such, as shown in 410.

Further details of the data modelling method and system are set forth below, with a particular focus on the details of the Gaussian process and underlying mathematical principles and procedures.

2. The Gaussian Process (GP)

Gaussian processes (GPs) provide a powerful learning framework for learning models of correlated and uncertain data. Gaussian process regression provides a robust means of estimation and interpolation of information that can handle incomplete sensor data effectively. GPs are non-parametric approaches in that they do not specify an explicit functional model between the input and output. They may be thought of as a Gaussian Probability Distribution in function space and are characterized by a mean function m(x) and the covariance function k(x, x′) where m(x)=E[ƒ(x)]  (1) k(x,x′)=E[(ƒ(x)−m(x))(ƒ(x′))]  (2) such that the GP is written as ƒ(x)˜GP(m(x),k(x,x′))  (3) The mean and covariance functions together provide a distribution over functions. In the context of modelling surface terrain, for example, each x≡(x, y) and ƒ(x)≡z of the given data. 2.1 The Covariance Function in the Gaussian Process

The covariance function models the covariance between the random variables which, here, correspond to sensor measured data. Although not necessary, for the sake of convenience the mean function m(x) may be assumed to be zero by scaling the data appropriately such that it has a mean of zero. There are numerous covariance functions that can be used to model the spatial variation between the data points. It will be understood that a covariance function will be positive semi-definite and symmetric, that is k(x,y)=k(y,x). The most popular covariance function is the squared-exponential covariance function given as

$\begin{matrix} {{k_{y}\left( {x_{p},x_{q}} \right)} = {{\sigma_{f}^{2}{\exp\left( {{- \frac{1}{2l^{2}}}\left( {x_{p} - x_{q}} \right)^{2}} \right)}} + {\sigma_{n}^{2}\delta_{pq}}}} & (4) \end{matrix}$ where k_(y) is the covariance function; l is the characteristic length, a measure of how quickly the ƒ(x) value changes in relation to the x value; σ_(f) ² is the signal variance and σ_(n) ² is the noise variance in the data being modelled. The symbol δ_(pq) represents a Kroeneker Delta defined on indices p and q. The set of parameters l, σ_(ƒ), σ_(n) are referred to as the hyperparameters and specify what sort of values the parameters might take.

Another covariance function, one that has been found to be successful in the present application, is the neural network covariance function. It is specified by

$\begin{matrix} {{k_{y}\left( {x,x^{\prime}} \right)} = {{\sigma_{f}^{2}{\arcsin\left( \frac{\beta + {2x^{T}\Sigma\; x^{\prime}}}{\sqrt{\begin{matrix} \left( {1 + \beta + {2x^{T}\Sigma\; x}} \right) \\ \left( {1 + \beta\; + {2x^{\prime\; T}\Sigma\; x^{\prime}}} \right) \end{matrix}}} \right)}} + {\sigma_{n}^{2}\delta_{pq}}}} & (5) \end{matrix}$ where Σ, σ_(ƒ), β and σ_(n) are the hyperparameters associated with the Gaussian process covariance function.

The difference between these two covariance functions is that the squared-exponential covariance function, being a function of |x−x′|, is stationary (invariant to translation) whereas the neural network covariance function is not so. In practice, the squared exponential covariance function has a smoothing or averaging effect on the data. The neural network covariance function proves to be much more effective than the squared exponential covariance function in handling discontinuous (rapidly changing) data.

Covariance functions in general and the covariance function described below can also be used in other kernel machines, for example support vector machines and kernel PCA (principal component analysis) machines. Kernel machines using the covariance function of the present invention may be used for machine learning or artificial intelligence techniques for data modelling applications including dimensionality reduction, classification problems, prediction/forecasting problems and regression analysis as described herein for spatial data.

Dimensionality reduction is used to reduce the number of data points that a data analysis uses and can be used for, for example, denoising, image compression or bio-informatics applications. Classification can be used, for example, for image recognition. Prediction methods can be used, for example, for forecasting in environmental sciences, e.g. for weather or pollution, for predicting failure times or rates of structures or devices, or for financial forecasting.

2.2 Training the Gaussian Process

Training the GP for a given dataset is tantamount to optimising the hyperparameters of the underlying covariance function. This training can be done using machine learning. It can also be done manually, for example by estimating the values and performing an iterative fitting process.

For a machine learning method, the hyperparameters are optimised with respect to the relevant covariance function. For the squared-exponential covariance function, this amounts to finding the optimal set of values for θ={l_(x), l_(y), l_(z), σ_(ƒ), σ_(n)}. For the neural network covariance function, the optimal values must be determined for θ={l_(x), l_(y), l_(z), σ_(ƒ), β, σ_(n)}. This is done by formulating the problem in a Maximum Likelihood Estimation framework and subsequently solving a non-convex optimization problem.

A Bayesian procedure is used to maximise the log marginal likelihood of the training output (y) given the training input (X) for a set of hyperparameters θ which is given by

$\begin{matrix} {{\log\left( {\left. y \middle| X \right.,\theta} \right)} = {{{- \frac{1}{2}}y^{T}K_{y}^{- 1}y} - {\frac{1}{2}\log{K_{y}}} - {\frac{n}{2}{\log\left( {2\pi} \right)}}}} & (6) \end{matrix}$ where K_(y)=K_(ƒ)+σ_(n) ²I is the covariance matrix for the noisy targets y. The log marginal likelihood has three terms—the first describes the data fit, the second term penalises model complexity and the last term is simply a normalisation coefficient. Thus, training the model will involve searching for the set of hyperparameters that enables the best data fit while avoiding overly complex models. Occam's razor is thus in-built in the system and prevention of over-fitting is guaranteed by the very formulation of the learning mechanism.

Using this maximum likelihood approach, training the GP model on a given set of data amounts to finding an optimal set of hyperparameters that maximize the log marginal likelihood (Eq. 6). This can be done using standard off-the-shelf optimization approaches. For example, a combination of stochastic search (simulated annealing) and gradient descent (Quasi-Newton optimization with BFGS Hessian update) has been found to be successful. Using a gradient based optimization approach leads to advantages in that convergence is achieved much faster. A description and further information about these optimization techniques and others can be found in the text Numerical Optimization, by J. Nocedal and S. Wright (Springer, 2006.

Applying the GP model amounts to using the learned GP model to estimate the elevation information across a region of interest, characterised by a grid of points at a desired resolution. The 2.5D elevation map can then be used as is or as a surface map for various applications. This is achieved by performing Gaussian Process Regression at the set of query points, given the training dataset and the GP covariance function with the learnt hyperparameters.

For additive independent identically distributed Gaussian noise with variance σ_(n) ², the prior on the noisy observations becomes cov(y _(p) ,y _(q))=k(x _(p) ,x _(q))+σ_(n) ²δ_(pq)  (7) where δ_(pq) is a Kroeneker Delta defined on p, q and is equal to 1 iff p=q and 0 otherwise.

The joint distribution of any finite number of random variables of a GP is Gaussian. Thus, the joint distribution of the training outputs ƒ and test outputs ƒ* given this prior can be specified by

$\begin{matrix} {\begin{bmatrix} y \\ f_{*} \end{bmatrix} \sim {N\left( {0,\begin{bmatrix} {{K\left( {X,X} \right)} + {\sigma_{n}^{2}I}} & {K\left( {X,X_{*}} \right)} \\ {K\left( {X_{*},X} \right)} & {K\left( {X_{*},X_{*}} \right)} \end{bmatrix}} \right)}} & (8) \end{matrix}$

The function values (ƒ_(*)) corresponding to the test inputs (X_(*)) given the training data X, training output y and covariance function K, is given by ƒ _(*) =K(X _(*) ,X)[K(X,X)+σ_(n) ² I] ⁻¹ y  (9) and their uncertainty is given by cov(ƒ_(*))=K(X _(*) ,X _(*))−K(X _(*) ,X)[K(X,X+σ _(n) ² I)]⁻¹ K(X,X _(*))  (10) Denoting K(X, X) by K and K(X, X_(*)) by K_(*); for a single test point x_(*), k(x_(*))=k_(*) is used to denote the vector of covariances between the test point and the set of all training points. The above equations can then be rewritten for a single query point as: θ _(*) =k _(*) ^(T)(K+σ _(n) ² I)⁻¹ y  (11) and V[ƒ _(*) ]=k(x _(*) ,x _(*))−k _(*) ^(T)(K+σ _(n) ² I)⁻¹ k _(*)  (12)

Equations (11) and (12) provide the basis for the elevation estimation process. The GP estimates obtained are a best linear unbiased estimate for the respective query points. Uncertainty is handled by incorporating the sensor noise model in the training data. The representation produced is a multi-resolution one in that a terrain model can be generated at any desired resolution using the GP regression equations presented above. Thus, the terrain modelling approach proposed is a probabilistic, multi-resolution one that aptly handles spatially correlated information.

Although the Gaussian process modelling as described above is a powerful method, modelling large-scale stochastic processes still presents challenges. The difficulty comes from the fact that inference in GPs is usually computationally expensive due to the need to invert a potentially large covariance matrix during inference time which has O(N³) cost. For problems with thousands of observations, exact inference in normal GPs is intractable and approximation algorithms are required.

Most of the approximation algorithms employ a subset of points to approximate the posterior distribution of a new point given the training data and hyperparameters. These approximations rely on heuristics to select the subset of points, or use pseudo targets obtained during the optimization of the log-marginal likelihood of the model.

3. The New Covariance Function

It is also possible to address the complexity problem differently. Instead of relying on sparse GP approximations, a new covariance function may be employed which provides intrinsically sparse covariance matrices. This allows exact inference in sparse GPs using conventional methods. The new sparse covariance function can be multiplied by any other covariance function and the result is a sparse covariance matrix, enabling a high degree of flexibility to accurately model problems while still preserving the sparseness properties. Gaussian processes constructed using this new sparse covariance function are referred to herein as Exact Sparse Gaussian Processes (ESGPs).

The ESGP utilizes a smooth covariance function whose output equals zero whenever the distance between input observations is larger than a hyperparameter. It will be understood that smooth means continuously differentiable at least once. As with other hyperparameters, this can be estimated by maximising the marginal likelihood to better model the properties of the data such as smoothness, characteristic length, and noise. The new covariance function resembles the popular squared exponential in terms of smoothness. The ESGP compares well with local approximation techniques and can be used together with other (non-stationary) covariance functions in the same modelling framework. The method results in very sparse covariance matrices (over 90% equal to zero in an in-ground grade estimation example presented below) which requires significantly less memory while providing better performance.

The covariance function sought must vanish out of some finite interval to enable exact sparse GP regression. It must preferably produce smooth sample curves but the sample curves should not be infinitely differentiable so that they will be applicable to inference of processes that have jumps in some derivatives.

The function ƒ(x)=cos²(πx)H(0.5−|x|) has been chosen as a basis function.

In view of cos²(πx)=(cos(2πx)+1)/2, the basis function is actually the cosine function shifted up, normalized and set to zero out of the interval x^(ε) (−0.5, 0.5). The cosine function was chosen as a basis function because it is analytically well tractable, integrals with finite limits containing its combinations, can be calculated in closed form and also the cosine function has proved to be able to provide good approximations for different functions and is a core element of the Fourier analysis. Here and afterwards H(.) represents the Heaviside unit step function. The chosen basis function ƒ(x) is smooth on the whole real axis, vanishes out of the interval x^(ε) (−0.5, 0.5) and has discontinuities in the second derivative.

Using the transfer function h(x; u)=ƒ(x−u) the following 1D covariance function can be obtained:

$\begin{matrix} {{K_{1}\left( {x,x^{\prime}} \right)} = {\sigma{\int_{- \infty}^{\infty}{{h\left( {\frac{x}{l};u} \right)}{h\left( {\frac{x^{\prime}}{l};u} \right)}\ {\mathbb{d}u}}}}} & (13) \end{matrix}$

Due to the chosen form of the basis function the integral in Eq. (13) can be analytically evaluated to result in:

$\begin{matrix} {{K_{1}\left( {x,{x^{\prime};l},\sigma_{0}} \right)} = \left\{ \begin{matrix} {\sigma_{0}\begin{bmatrix} {{\frac{2 + {\cos\left( {2\pi\frac{d}{l}} \right)}}{3}\left( {1 - \frac{d}{l}} \right)} +} \\ {\frac{1}{2\pi}{\sin\left( {2\pi\frac{d}{l}} \right)}} \end{bmatrix}} & {{{if}\mspace{14mu} d} < l} \\ 0 & {{{if}\mspace{14mu} d} \geq l} \end{matrix} \right.} & (14) \end{matrix}$ where σ₀>0 is a constant coefficient, l>0 is a characteristic length and d is the distance between the points: d=|x−x′|  (15)

From Eq. (14) it follows that for any points x_(i) and any numbers a_(i) where i=1, 2, . . . , n the inequality

${{\sum\limits_{i,{j = 1}}^{n}\;{a_{i}a_{j}{K_{1}\left( {x_{i},x_{j}} \right)}}} = {{\sigma{\int_{- \infty}^{\infty}{\left( {\sum\limits_{i = 1}^{n}\;{a_{i}{h\left( {\frac{x_{i}}{l};u} \right)}}} \right)^{2}\ {\mathbb{d}u}}}} \geq {0\mspace{14mu}{holds}}}},$ so that the constructed covariance function is positive semi-definite.

Based on Eqs. (14)-(15) it can be calculated that

$\begin{matrix} {{K❘_{d = l}} = {{\frac{\partial K}{\partial d}❘_{d = l}} = {{\frac{\partial^{2}K}{\partial d^{2}}❘_{d = l}} = {{\frac{\partial^{3}K}{\partial d^{3}}❘_{d = l}} = {{\frac{\partial^{4}K}{\partial d^{4}}❘_{d = l}} = 0}}}}} & (16) \\ {{\frac{\partial^{5}K}{\partial d^{5}}❘_{d = l}} = {{{- 4}\pi^{4}} \neq 0}} & (17) \end{matrix}$ which shows that the covariance function K₁ is continuous and has continuous 4^(th) derivative. The function K₁ (d,0;1,1) is illustrated in FIG. 6.

This covariance function can be extended to multiple dimensions in the following ways:

1. Using direct products for all axes:

$\begin{matrix} {{K_{M}^{(1)}\left( {x,{x^{\prime};L},\sigma_{o}} \right)} = {\sigma_{o}{\prod\limits_{i = 1}^{D}\;{K_{1}\left( {x_{i},{x_{i}^{\prime};l_{i}},1} \right)}}}} & (18) \end{matrix}$ where D is the dimensionality of the points; x=(x ₁ ,x ₂ , . . . ,x _(D))^(T) ,x′=(x′ ₁ ,x′ ₂ , . . . ,x′ _(D))^(T)  (19) are the points and their coordinates; and L is the vector of the characteristic lengths: L=(l ₁ ,l ₂ , . . . ,l _(D))^(T)  (20) 2. Using Mahalanobis distance:

$\begin{matrix} {{K_{M}^{(2)}\left( {{r;\sigma_{o}},\Omega} \right)} = {{{\sigma_{o}\begin{bmatrix} {{\frac{2 + {\cos\left( {2\pi\; r} \right)}}{3}\left( {1 - r} \right)} +} \\ {\frac{1}{2\pi}{\sin\left( {2\pi\; r} \right)}} \end{bmatrix}}\mspace{14mu}{if}\mspace{14mu} r} < {l\begin{matrix} \; & \; \\ \; & \; \end{matrix}}}} & (21) \\ \begin{matrix} {{K_{M}^{(2)}\left( {{r;\sigma_{o}},\Omega} \right)} = {{{if}\mspace{14mu} r} \geq l}} & \mspace{11mu} \end{matrix} & (22) \end{matrix}$ where σ₀>0, Ω is positive definite and i=√{square root over ((x−x′)^(T)Ω(x−x′))}{square root over ((x−x′)^(T)Ω(x−x′))},Ω>0  (23) K_(M) is used in this specification to refer to the function K_(M) ⁽²⁾(r;σ₀Ω.

The developed new multi-dimensional covariance function in both its forms K_(M) ⁽¹⁾ and K_(M) ⁽²⁾ has the following remarkable properties:

-   1. It vanishes out of some finite region S:     S ₂ ={rε     ^(D) :K _(M) ⁽²⁾(r)≠0}  (24)     S ₂ ={rε     ^(D) :K _(M) ⁽²⁾(r)≠0}  (25)     -   Sizes of the regions S₁ and S₂ can be controlled via the         characteristic lengths l_(i). Moreover, these sizes can be         learned from the data using GPs. -   2. All the derivatives up to (and including) the fourth order     derivative vanish at the perimeter of S, which guarantees mean     square differentiability up to the corresponding order of the sample     curves in GPs. There is a discontinuity at the perimeter for the     fifth order gradient. -   3. The region S₁ is a D dimensional rectangle and the region S₂ is a     D dimensional ellipsoid. -   4. In the case of one dimension K_(M) ⁽¹⁾ and K_(M) ⁽²⁾ become     identical. -   5. This covariance function makes it possible to learn the     anisotropic properties of the data (i.e. different inner properties     in different directions). -   6. This covariance function leads to very sparse covariance matrices     and makes it possible to study the whole picture of huge datasets     with low memory and computational cost requirements and without     making local approximations.

Based on Eqs. (14)-(20) the following expressions for the partial derivatives of K_(M) ⁽¹⁾ (x,x′;L,σ₀) can be calculated:

$\begin{matrix} {\mspace{79mu}{\frac{\partial K_{M}^{(1)}}{\partial\sigma_{0}} = {\frac{1}{\sigma_{0}}K_{M}^{(1)}}}} & (26) \\ {\frac{\partial K_{M}^{(1)}}{\partial l_{i}} = {\frac{4\sigma_{0}}{3}\frac{K_{M}^{(1)}}{K_{i}}{\frac{d_{i}}{l_{i}^{2}}\left\lbrack {{{\pi\left( {1 - \frac{d_{i}}{l_{i}}} \right)}{\cos\left( {\pi\frac{d_{i}}{l_{i}}} \right)}} + {\sin\left( {\pi\frac{d_{i}}{l_{i}}} \right)}} \right\rbrack}{\sin\left( {\pi\frac{d_{i}}{l_{i}}} \right)}}} & (27) \end{matrix}$ where i=1, 2, . . . , D.

If Ω is diagonal and positive definite it can be expressed via the characteristic lengths as follows:

$\begin{matrix} {\Omega = {{diag}\left( {\frac{1}{l_{1}^{2}},\frac{1}{l_{2}^{2}},\ldots\mspace{14mu},\frac{1}{l_{D}^{2}}} \right)}} & \; & (28) \end{matrix}$

From Eqs. (23)-(28) it follows that

$\begin{matrix} {r = \sqrt{\sum\limits_{k = 1}^{D}\;\left( \frac{x_{k} - x_{k}^{\prime}}{l_{k}} \right)^{2}}} & (29) \end{matrix}$

Based on Eqs. (21)-(23), (28)-(29) the following gradient components of this multi-dimensional covariance function K_(M) can be obtained:

$\begin{matrix} {{\frac{\partial K_{M}^{\;}}{\partial\sigma_{0}} = {{\frac{2 + {\cos\left( {2\pi\; r} \right)}}{3}\left( {1 - r} \right)} + {\frac{1}{2\pi}{\sin\left( {2\pi\; r} \right)}}}},{{{if}\mspace{14mu} 0} \leq r < 1}} & (30) \\ {{\frac{\partial K_{M}}{\partial l_{j}} = {{\frac{4\sigma_{0}}{3}\left\lbrack {{{\pi\left( {1 - r} \right)}{\cos\left( {\pi\; r} \right)}} + {\sin\left( {\pi\; r} \right)}} \right\rbrack}\frac{\sin\left( {\pi\; r} \right)}{r}\frac{1}{l_{j}}\left( \frac{x_{j} - x_{j}^{\prime}}{l_{j}} \right)^{2}}},\mspace{79mu}{{{if}\mspace{14mu} 0} < r < 1}} & (31) \\ {\mspace{79mu}{{{gradK}_{M} = 0},{{{if}\mspace{14mu} r} \geq 1}}} & (32) \end{matrix}$

In Eq. (31) there is r in the denominator, so that direct calculations cannot be carried out using Eq. (31) when r=0. However, using the equality

$\begin{matrix} {{\lim\limits_{r\rightarrow 0}\frac{\sin\left( {\mu\; r} \right)}{r}} = \mu} & (33) \end{matrix}$ one can directly show that

$\begin{matrix} {{\lim\limits_{r\rightarrow 0}{\frac{\partial K_{M}}{\partial l_{j}}\left( {{r;\sigma_{0}},\Omega} \right)}} = {{\lim\limits_{r\rightarrow 0}{\frac{4\sigma_{0}}{3}\pi^{2}\frac{1}{l_{j}}\left( \frac{x_{j} - x_{j}^{\prime}}{l_{j}} \right)^{2}}} = 0}} & (34) \end{matrix}$

Based on Eq. (34) it must be taken directly

$\begin{matrix} {{{\frac{\partial K_{M}}{\partial l_{j}}❘_{r = 0}} = 0},{j = 1},2,\ldots\mspace{14mu},D} & (35) \end{matrix}$

Equations (30)-(32), (35) fully define the gradient of the new covariance function K_(M) at every point and can be directly used in calculations.

-   4. Advantages Over the Neural Network Covariance Function

As described above, the neural network (NN) covariance function is known for its ability to model discontinuities without undesired oscillations. However, numerical computations and comparisons shown in FIGS. 7 and 8 demonstrate that K_(M) provides much better results and is independent of axes translations. In these figures the neural network covariance function K_(NN) and the covariance function K_(M) were each used to model a set of data points and the results are shown side-by-side. As can be seen in the plots of the actual data points and resulting fitted curves, in each instance the sparse covariance function results in a curve that more closely follows the actual data then the neural network covariance function. For example, in FIG. 7 the curves fitted to the data as a result of the K_(NN) covariance function can be seen to vary with axis translations, whilst K_(M) does not. In FIG. 7, K_(M) provides reliable results in each case, whereas K_(NN) is unable to fit a curve to the data points in the last instance. Furthermore, K_(M) is more reliable, has better performance, requires much less memory usage and has much less computational cost than the neural network covariance function.

Application of this new covariance function to an in-ground ore grade estimation problem has shown that a covariance matrix which has about 2 million cells has over 90% of its cells exactly equal to 0. This provides possibilities for significantly decreasing the memory and computational costs of the computations. Using K_(M) the number of zero cells is O(n²) while the number of nonzero cells is O(n). Consequently, the percentage of zeros in the covariance matrix will significantly grow for bigger datasets. It can become over 95%, over 99% and even greater as the dataset becomes bigger and bigger.

To demonstrate the benefits of the proposed approach in reducing storage and number of operations for the same accuracy, the exact sparse GP can be compared with the exact GP with the squared exponential covariance function and the covariance function obtained by the multiplication of both of them. The dataset used for this example is a popular dataset in statistics for comparing inference procedures and is known as the Spatial Interpolation Comparison dataset (SIC). The dataset consists of 467 points measuring daily rainfall measurements in 2D geographical space. These points are divided into two sets, inference and testing. The inference set contains the points used to perform inference on the testing points. For each case the experiment is repeated 1500 times with randomly selected inference and testing sets. FIG. 9 shows the normalized squared error for the different covariance functions and the standard deviation (one sigma for each part of the bar) as a function of the number of inference points. As the number of inference points increases, so does the size of the covariance matrix. The results demonstrate that very similar errors are obtained for the difference covariances. However, the sparse covariance function produces sparse matrices thus requiring much less floating point operations. FIG. 10 shows the percentage of zeros in the covariance matrix as a function of the number of inference points. As can be observed, the percentage of zeros grows quickly as more inference points are added and it reaches its limit around 100 inference points. Although the percentage of zeros reaches its limit, the number of zeros in the covariance matrix still increases because the size of the covariance matrix increases with the number of inference points. Also worth noticing is the performance of the multiplication between the two covariance functions. The error is essentially the same as for the sparse covariance function alone but the percentage of zeros for the sparse covariance function is significantly greater than for the product.

The foregoing description shows that large scale data modelling using Gaussian process techniques can be substantially improved in terms of both modelling accuracy and required computational effort by employing a sparse covariance function in isolation or in combination with another stationary or non-stationary covariance function (e.g. the non-stationary neural-network covariance function). The Exact Sparse Gaussian Process is successfully able to model large complex datasets whilst requiring significantly less memory and computational effort as compared to known GP applications.

The foregoing detailed description of the present invention has been presented by way of example only and is not intended to limit the scope of the invention which includes each and every novel feature and combination of novel features herein disclosed. 

The invention claimed is:
 1. A computer-implemented method for modelling data using a Gaussian process comprising: obtaining data to be modelled; using the computer to model the obtained data by determining hyperparameters of a sparse covariance function for the Gaussian process, the hyperparameters including a characteristic length determined from the data; and using the computer to define the sparse covariance function for the Gaussian process that diminishes to zero outside of the characteristic length; wherein the sparse covariance function results in a covariance matrix with a sparseness that depends on the determined characteristic length.
 2. The method of claim 1, wherein the sparse covariance function is smooth.
 3. The method of claim 1, wherein the sparse covariance function has a continuous fourth derivative.
 4. The method of claim 1, further comprising determining the characteristic length through a machine learning process.
 5. The method of claim 1, wherein the sparse covariance function is multi-dimensional with a separate characteristic length for each dimension.
 6. The method of claim 1, further comprising combining a non-stationary covariance function with the sparse covariance function for the Gaussian process.
 7. The method of claim 6, wherein the non-stationary covariance function is a neural network covariance function.
 8. The method of claim 1, wherein the data is measured using one or more measurement sensors.
 9. The method as claimed in claim 8, wherein the data represents geographical surface terrain.
 10. The method of claim 8, wherein the data represents in-ground geological mineral distribution.
 11. A computer-implemented method for modelling large scale data representing a distribution of physical properties, comprising obtaining a measured dataset, using the computer to apply an exactly sparse Gaussian process covariance function to the measured dataset to determine an optimized set of hyperparameter values associated with the Gaussian process covariance function, which optimized set of hyperparameter values includes a characteristic length, the exactly sparse Gaussian process covariance function diminishing to zero outside of the characteristic length, and using the computer to generate selected model data by Gaussian process regression using the optimized hyperparameter set and the measured dataset, wherein the exactly sparse Gaussian process covariance function results in a covariance matrix with a sparseness that depends on the characteristic length.
 12. The method as claimed in claim 11, wherein the exactly sparse Gaussian process covariance function comprises a sparse covariance function that is smooth and diminishes to zero outside of the characteristic length hyperparameter, and a non-stationary neural network covariance function.
 13. The method as claimed in claim 11, wherein the exactly sparse Gaussian process covariance function is multi-dimensional with a separate characteristic length hyperparameter for each dimension.
 14. The method as claimed in claim 11, wherein the measured dataset represents geographical surface terrain measurements.
 15. The method as claimed in claim 11, wherein the measured dataset represents in-ground geological mineral distribution measurements.
 16. A system for large scale data modelling, comprising: at least one data measurement sensor for generating measured data representing a distribution of physical properties in a selected geographical region; a training processor adapted to determine for the measured data optimized hyperparameter values in relation to a Gaussian process covariance function comprising a sparse covariance function that is smooth and diminishes to zero outside of a characteristic length, wherein the characteristic length is determined from the measured data and wherein the sparse covariance function results in a covariance matrix with a sparseness that depends on the determined characteristic length; and an evaluation processor adapted to determine model data from the Gaussian process covariance function with optimised hyperparameter values and the measured data.
 17. The system as claimed in claim 16, wherein the Gaussian process covariance function also comprises a non-stationary neural network covariance function.
 18. The system as claimed in claim 16, wherein the measured data comprises geographical surface terrain measurements.
 19. The system as claimed in claim 16, wherein the measured data comprises in-ground ore grade distribution measurements.
 20. A computational method for modelling a data space, the method comprising: using a computational system, applying to the data space a kernel machine, wherein the kernel machine uses a sparse covariance function which is constructed from a smooth basis function equal to zero outside of a characteristic length hyperparameter determined from the data space, wherein the sparse covariance function results in a covariance matrix with a sparseness that depends on the characteristic length hyperparameter; and one of outputting and storing in memory a model from the kernel machine.
 21. The method of claim 20 wherein the kernel machine uses a Gaussian learning process.
 22. The method of claim 20, wherein the basis function is a squared cosine wave.
 23. The method of claim 20, wherein the basis function is cos²(πx)H(0.5−|x|) where H(.) is a step function.
 24. The method of claim 20, wherein the data space is multi-dimensional having N dimensions with the sparse covariance function ${K_{1}\left( {x,{x^{\prime};l},\sigma_{0}} \right)} = \left\{ {\begin{matrix} {\sigma_{0}\begin{bmatrix} {{\frac{2 + {\cos\left( {2\pi\frac{d}{l}} \right)}}{3}\left( {1 - \frac{d}{l}} \right)} +} \\ {\frac{1}{2\pi}{\sin\left( {2\pi\frac{d}{l}} \right)}} \end{bmatrix}} & {{{if}\mspace{14mu} d} < l} \\ 0 & {{{if}\mspace{14mu} d} \geq l} \end{matrix},{d = {{x - x^{\prime}}}}} \right.$ extended to multiple dimensions.
 25. A computational method for modelling a data space, the method comprising: using a computational system, applying to the data space a kernel machine, wherein the kernel of the kernel machine is a positive semi-definite function and a symmetric function, equal to zero outside of a characteristic length hyperparameter determined from the data space, and wherein the kernel results in a covariance matrix with a sparseness that depends on the determined characteristic length hyperparameter; and at least one of outputting and storing in memory a model from the kernel machine. 